Dei: A Theorem Prover for Terms with Integer Exponents
نویسندگان
چکیده
An extension of the superposition-based E-prover [8] is described. The extension allows terms with integer exponents [3] in the input language. Obviously, this possibility increases the capabilities of the E-prover particularly for preventing non-termination.
منابع مشابه
Utilisation des schématisations de termes en déduction automatique. (Using term schematisations in automated deduction)
Term schematisations allow one to represent infinite sets of terms having a similar structure by a finite and compact form. In this work we study some issues related to the use of term schematisation in automated deduction, in particular in saturation-based first-order theorem proving. After a brief comparative study of existing schematisation formalisms, we focus on terms with integer exponent...
متن کاملTree Interpolation in Vampire
We describe new extensions of the Vampire theorem prover for computing tree interpolants. These extensions generalize Craig interpolation in Vampire, and can also be used to derive sequence interpolants. We evaluated our implementation on a large number of examples over the theory of linear integer arithmetic and integer-indexed arrays, with and without quantifiers. When compared to other metho...
متن کاملQuasilinear Schrödinger equations involving critical exponents in $mathbb{textbf{R}}^2$
We study the existence of soliton solutions for a class of quasilinear elliptic equation in $mathbb{textbf{R}}^2$ with critical exponential growth. This model has been proposed in the self-channeling of a high-power ultra short laser in matter.
متن کاملExponents of Diophantine Approximation and Sturmian Continued Fractions
– Let ξ be a real number and let n be a positive integer. We define four exponents of Diophantine approximation, which complement the exponents w n (ξ) and w * n (ξ) defined by Mahler and Koksma. We calculate their six values when n = 2 and ξ is a real number whose continued fraction expansion coincides with some Sturmian sequence of positive integers, up to the initial terms. In particular, we...
متن کاملCritical exponents of infinite balanced words
Over an alphabet of size 3 we construct an infinite balanced word with critical exponent 2 + √ 2/2. Over an alphabet of size 4 we construct an infinite balanced word with critical exponent (5 + √ 5)/4. Over larger alphabets, we give some candidates for balanced words (found computationally) having small critical exponents. We also explore a method for proving these results using the automated t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009